Generalized Scalarizing Problems Gens and Genslex of Multicriteria Optimization1
نویسندگان
چکیده
Generalized scalarizing problems, called GENS and GENSLex, for obtaining Pareto optimal solutions of multicriteria optimization problems are presented in the paper. The basic properties of these scalarizing problems are described. The existence of single-criterion problems with differentiable objective functions and constraints, which are equivalent to GENS and GENSLex scalarizing problems, are pointed out.
منابع مشابه
Generalized Scalarizing Model GENS in DSS WebOptim
A web-based Decision Support System WebOptim for solving multiple objective optimization problems is presented. Its basic characteristics are: user-independent, multisolver-admissibility, method-independent, heterogeneity, web-accessibility. Core system module is an original generalized interactive scalarizing method. It incorporates a number of thirteen interactive methods. Most of the known s...
متن کاملGeneralized Interactive Algorithm of Multicriteria Optimization*
In the interactive algorithms for multicriteria optimization the decision maker (DM) may express his/her preferences among the separate Pareto optimal solutions with the help of the values of the scalarizing problem parameters. The DM must choose the final (most preferred) solution and be responsible for this selection. The interactive methods are the best developed and wide spread methods. Thi...
متن کاملGeneralized interval-valued intuitionistic fuzzy Hamacher generalized Shapley Choquet integral operators for multicriteria decision making
The interval-valued intuitionistic fuzzy set (IVIFS) which is an extension of the Atanassov’s intuitionistic fuzzy set is a powerful tool for modeling real life decision making problems. In this paper, we propose the emph{generalized interval-valued intuitionistic fuzzy Hamacher generalized Shapley Choquet integral} (GIVIFHGSCI) and the emph{interval-valued intuitionistic fuzzy Hamacher general...
متن کاملA Partition-Based Interactive Algorithm for Solving Multicriteria Linear Integer Programming Problems*
We propose a learning-oriented interactive algorithm for solving multicriteria linear integer programming (MCLIP) problems, considered as multicriteria decision making problems. At each iteration, the DM may partition the criteria set into at most seven classes, namely: improvement, improvement by a desired amount, deterioration, deterioration by at most a certain amount, nondeterioration, chan...
متن کاملA User-Friendly Interactive Algorithm of the Multicriteria Linear Integer Programming
The interactive algorithms are often used [2] to solve multicriteria linear integer programming problems (MCIP). These algorithms [3, 6, 7, 11, 13] are modifications of interactive approaches solving multicriteria linear problems that include the integrality constraints. Linear integer programming problems are used as scalarizing problems in these interactive algorithms. These problems are NP-d...
متن کامل